Response Surface Analysis of Two-Stage Stochastic Linear Programming with Recourse
نویسندگان
چکیده
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two-stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the firststage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first-stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben–Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two-stage problems which includes the classical capacity expansion model. c © 1999 John Wiley & Sons, Inc.* Naval Research Logistics 46: 753–776, 1999
منابع مشابه
Multi-Objective Stochastic Programming in Microgrids Considering Environmental Emissions
This paper deals with day-ahead programming under uncertainties in microgrids (MGs). A two-stage stochastic programming with the fixed recourse approach was adopted. The studied MG was considered in the grid-connected mode with the capability of power exchange with the upstream network. Uncertain electricity market prices, unpredictable load demand, and uncertain wind and solar power values, du...
متن کامل2-stage stochastic linear programming
We consider the other direction: the 2-stage stochastic programming problem (or also called stochastic recourse problem). Conceptually one should think of the decision process taking place in two stages. In the first, values for the first stage variables x are chosen. In the second, upon a realisation of the random parameters, a recourse action is to be taken in case of infeasibilities. Costs a...
متن کاملOn the Glivenko-Cantelli problem in stochastic programming: Mixed-integer linear recourse
Expected recourse functions in linear two-stage stochastic programs with mixed-integer second stage are approximated by estimating the underlying probability distribution via empirical measures. Under mild conditions, almost sure uniform convergence of the empirical means to the original expected recourse function is established.
متن کاملDecomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse
Zhao [28] recently showed that the log barrier associated with the recourse function of twostage stochastic linear programs behaves as a strongly self-concordant barrier and forms a self concordant family on the first stage solutions. In this paper we show that the recourse function is also strongly self-concordant and forms a self concordant family for the two-stage stochastic convex quadratic...
متن کاملTwo-Stage Stochastic Semidefinite Programming and Decomposition Based Interior Point Methods: Theory
We introduce two-stage stochastic semidefinite programs with recourse and present a Benders decomposition based linearly convergent interior point algorithms to solve them. This extends the results in Zhao [16] wherein it was shown that the logarithmic barrier associated with the recourse function of two-stage stochastic linear programs with recourse behaves as a strongly self-concordant barrie...
متن کامل